2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian
نویسندگان
چکیده
In the last lecture, we discussed Reference Broadcast Synchronization, a mechanism which addresses the problem of energy-frugal μ-second precision time synchronization. The method involved synchronization between receivers based on the arrival time of a reference broadcast. The algorithm was extended to work on multiple domains as well, where nodes not in the same broadcast domain achieve this by performing a chain of pairwise synchronizations.
منابع مشابه
Discrete Algorithms for Mobile and Wireless Networks Lecture 23 : Thursday , 12 th April 2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian
With large-scale wireless networks, the associated challenges of self-configuration of the network , self-healing in the case of any failure and self-maintenance assume significant importance. Without even one these features, the sensor network formed cannot be used any further. A possible solution to this problem is to use clustering of the nodes in the network. A geographical-radius based clu...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 12 : Thursday , 22 nd February 2007 Instructor : Soma Chaudhuri Scribe : Aaron Sterling
This class period focused on a theoretical application of collision-detectors to solve the consensus problem; and the implementation of replicated state machines, to produce fault-tolerant wireless networks. We reviewed two papers: “Consensus and Collision Detectors in Wireless Ad Hoc Networks” by G. Chockler, M. Demirbas and S. Gilbert; and “Replicated State Machines” by G. Chockler and S. Gil...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Topology control : cone based ( CBTC ) Instructor : Soma Chaudhuri Nalin Subramanian
In the wireless network, the limitations are energy, communication and several other known issues. PErhaps, the major challenge is to save energy and reduce the possible interference in the wireless medium. Since the nodes are in wireless range, single node transmitting message can be heard by all other nodes in the neighborhood. It is high likely possible to have greater interference. The grea...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 10 : Part A : Thursday Feb 15 th , 07 Instructor : Soma
Recent research envisions wireless sensor networks as collections of tiny, autonomous devices with computation, sensing and communication capabilities. Various implementations of such so-called sensor motes exist and networks of different scales have been deployed. There has been active research both on theory and algorithms and on software architectures. Although many classical distributed res...
متن کاملInstructor : Soma Chaudhuri Scribe : Eric Hare 1 Two - Processor Consensus Problem
We have proven that the two-processor wait-free consensus is not possible solely with read/write objects. This implies that an n-processor wait-free consensus is also not possible solely with read/write objects. Suppose that by contradiction, two-processor wait-free consensus is not possible, but n-processor wait-free consensus is possible for some n > 1. Then, every execution where all but two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007